Symbolic verification of ECA rules

Symbolic Termination and Confluence Checking for ECA Rules

Event-condition-action (ECA) rules can specify decision processes and are widely used in reactive systems and active database systems. Applying formal verification techniques to guarantee properties of the designed ECA rules is essential to help the error-prone procedure of collecting and translating expert knowledge. However, while the nondeterministic and concurrent semantics of ECA rule exec...

Runtime verification of programs using rule-based active system

Glider Collisions in Hybrid Cellular Automaton Rules

Elementary cellular automaton (ECA) rules 9 and 74, members of Chua’s Bernoulli shift rules and Wolfram’s class 2, can generate a host of gliders and complicated glider collisions by introducing the hybrid mechanism. These gliders and collisions are more plentiful than those generated by ECA rule 110. This paper presents a discussion of the symbolic dynamics of the gliders in hybrid cellular au...

The RERS Grey-Box Challenge 2012: Analysis of Event-Condition-Action Systems

The goal of the RERS Grey-Box Challenge is to evaluate the effectiveness of various verification and validation approaches on EventCondition-Action (ECA) systems, which form a specific class of systems that are important for industrial applications. We would like to bring together researchers from all areas of software verification and validation, including theorem proving, model checking, prog...

BDD-Based Software Model Checking with CPAchecker

In symbolic software model checking, most approaches use predicates as symbolic representation of the state space, and SMT solvers for computations on the state space; BDDs are sometimes used as auxiliary data structure. The representation of software state spaces by BDDs was not yet thoroughly investigated, although BDDs are successful in hardware verification. The reason for this is that BDDs...